A new method on deterministic construction of the measurement matrix in compressed sensing

نویسنده

  • Qun Mo
چکیده

Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic construction method and prove it is optimal with regard to the mutual incoherence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Explicit RIP Matrices in Compressed Sensing from Algebraic Geometry

Compressed sensing was proposed by E. J. Candés, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement matrices are needed in practice. Since 2007 R. DeVore, J. Bourgain et al and R. Calderbank et al have given several deterministic cosntrcutions of RIP matrice...

متن کامل

Deterministic construction of Fourier-based compressed sensing matrices using an almost difference set

In this paper, a new class of Fourier-based matrices is studied for deterministic compressed sensing. Initially, a basic partial Fourier matrix is introduced by choosing the rows deterministically from the inverse discrete Fourier transform (DFT) matrix. By row/column rearrangement, the matrix is represented as a concatenation of DFT-based submatrices. Then, a full or a part of columns of the c...

متن کامل

Sparse kronecker pascal measurement matrices for compressive imaging

Background: The construction of measurement matrix becomes a focus in compressed sensing (CS) theory. Although random matrices have been theoretically and practically shown to reconstruct signals, it is still necessary to study the more promising deterministic measurement matrix. Methods: In this paper, a new method to construct a simple and efficient deterministic measurement matrix, sparse kr...

متن کامل

An asymptotic existence result on compressed sensing matrices

For any rational number h and all sufficiently large n we give a deterministic construction for an n× bhnc compressed sensing matrix with (`1, t)-recoverability where t = O( √ n). Our method uses pairwise balanced designs and complex Hadamard matrices in the construction of -equiangular frames, which we introduce as a generalisation of equiangular tight frames. The method is general and produce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1503.01250  شماره 

صفحات  -

تاریخ انتشار 2015